Newcomb’s problem isn’t a choice dilemma

Adults versus teenagers: a false dilemma and a dangerous choice.

Social choice and the indexing dilemma

This paper distinguishes an index ordering and a social ordering function as a simple way to formalize the indexing problem in the social choice framework. Two main conclusions are derived. First, the alleged dilemma between welfarism and perfectionnism is shown to involve a third possibility, exemplified by the fairness approach to social choice. Second, the idea that an individual is better o...

A redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm

This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...

Optimal Stopping Policy for Multivariate Sequences a Generalized Best Choice Problem

  In the classical versions of “Best Choice Problem”, the sequence of offers is a random sample from a single known distribution. We present an extension of this problem in which the sequential offers are random variables but from multiple independent distributions. Each distribution function represents a class of investment or offers. Offers appear without any specified order. The objective is...

Redundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies

To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...